Efficient Collection in Infinite Polycyclic Groups
نویسندگان
چکیده
منابع مشابه
Using the Mal’cev correspondence for collection in polycyclic groups
We describe several approaches for realizing the Mal’cev correspondence between Q-powered nilpotent groups and nilpotent Lie algebras over Q. We apply it to fast collection in polycyclic groups. Our methods are fully implemented and publicly available. We report on the implementation and give runtimes for some example groups.
متن کاملEfficient multiplication algorithms for finite polycyclic groups
Let G be a finite soluble group given by a reduced confluent polycyclic presentation. Represent group elements by reduced words. Then there exists an algorithm for multiplying two group elements which has subexponential running time and requires polynomial space. Moreover, given the prime factorisation of the group order, the problem of multiplying two group elements is probabilistically polyno...
متن کاملgroups whose proper subgroups of infinite rank have polycyclic-by-finite conjugacy classes
a group g is said to be a (pf)c-group or to have polycyclic-by-finite conjugacy classes, if g/c_{g}(x^{g}) is a polycyclic-by-finite group for all xin g. this is a generalization of the familiar property of being an fc-group. de falco et al. (respectively, de giovanni and trombetti) studied groups whose proper subgroups of infinite rank have finite (respectively, polycyclic) conjugacy classes. ...
متن کاملA relation between infinite subsets and exterior center in groups
Let G be a group. Neumann to answer a question of Paul Erdos proved that every infinite subset of G has two different comuting elements if and only if G is center-by-finite. In this paper, we deal with Erdoschr('39')s question in different aspect and we show that every infinite subset X of G has two different elements x and y such that x^y=1 if and only if the exterior center of G ihas finit...
متن کاملOn Ordered Polycyclic Groups
It has been asserted that any (full) order on a torsion-free, finitely generated, nilpotent group is defined by some F-basis of G and that the group of o-automorphisms of such a group is itself a group of the same kind: Examples provided herein demonstrate that both of these assertions are false; however, it is proved that the group of o-automorphisms of an ordered, polycyclic group is nilpoten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2002
ISSN: 0747-7171
DOI: 10.1006/jsco.2002.0559